Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm
نویسندگان
چکیده
منابع مشابه
An Analysis and Implementation of a Parallel Ball Pivoting Algorithm
The problem of surface reconstruction from a set of 3D points given by their coordinates and oriented normals is a difficult problem, which has been tackled with many different approaches. In 1999, Bernardini and colleagues introduced a very elegant and efficient reconstruction method that uses a ball pivoting around triangle edges and adds new triangles if the ball is incident to three points ...
متن کاملCircle graph obstructions under pivoting
A circle graph is the intersection graph of a set of chords of a circle. The class of circle graphs is closed under pivotminors. We determine the pivot-minor-minimal non-circle-graphs; there 15 obstructions. These obstructions are found, by computer search, as a corollary to Bouchet’s characterization of circle graphs under local complementation. Our characterization generalizes Kuratowski’s Th...
متن کاملA generalized complementary pivoting algorithm
The first algorithm to use a complementary pivoting procedure was that devised by Lemke and Howson to find a Nash equilibrium point of a bimatrix game [ 15 ]. This algorithm introduced a novel proof of convergence not relying on standard monotonicity arguments. Lemke [ 12] generalized his complementary pivot algorithm to solve certain classes of linear complementarity problem (LCP), which Dantz...
متن کاملAnalysis of a Dominant Retailer Dual-Channel Supply Chain under Customers’ Channel Preference: The α-Branch and Bound Solution Algorithm
This paper investigates the Stackelberg equilibrium for pricing and ordering decisions in a dominant retailer dual-channel supply chain. In a dual-channel sales network, the products are sold through both a traditional, physical retailer and a direct Internet channel. It is assumed that the retailer is the leader and the powerful member of the supply chain has the market power and acts as a lea...
متن کاملAn Extended Note on the Comparison-optimal Dual-Pivot Quickselect
In this note the precise minimum number of key comparisons any dual-pivot quickselect algorithm (without sampling) needs on average is determined. The result is in the form of exact as well as asymptotic formulæ of this number of a comparison-optimal algorithm. It turns out that the main terms of these asymptotic expansions coincide with the main terms of the corresponding analysis of the class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2014
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-014-9953-x